the preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: an integer programming approach

extensive research has been devoted to resource constrained project scheduling problem. however, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. in this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, where each time an activity is started after being preempted; a constant setup penalty is incurred. we propose a solution method based on a pure integer formulation for the problem. finally, some test problems are solved with lingo version 8 and computational results are reported.